#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    vector<vector<int>> highestPeak(vector<vector<int>>& w) {
        int m = w.size(), n = w[0].size();
        queue<pair<int, int>>q;
        bool vis[1000][1000];
        memset(vis, 0, sizeof vis);
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (w[i][j])
                {
                    w[i][j] = 0;
                    vis[i][j] = true;
                    q.push({ i,j });
                }

            }
        }
        int dx[4] = { 0,0,1,-1 };
        int dy[4] = { 1,-1,0,0 };
        while (q.size())
        {
            auto [a, b] = q.front();
            q.pop();
            for (int i = 0; i < 4; i++)
            {
                int x = a + dx[i], y = b + dy[i];
                if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y])
                {
                    w[x][y] = w[a][b] + 1;
                    q.push({ x,y });
                    vis[x][y] = true;
                }
            }
        }
        return w;
    }
};